On the smallest $k$ such that all $k·2\sp{n}+1$ are composite
نویسندگان
چکیده
منابع مشابه
On the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian
In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.
متن کاملAlmost All Palindromes Are Composite
We study the distribution of palindromic numbers (with respect to a fixed base g ≥ 2) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes n ≤ x as x → ∞. Our results show that almost all palindromes in a given base are composite. ∗MSC Numbers: 11A63, 11L07, 11N69 †Corresponding author 1
متن کاملMatrices A such that AA+ - A+A are nonsingular
In this paper we study the class of square matrices A such that AA − AA is nonsingular, where A stands for the Moore–Penrose inverse of A. Among several characterizations we prove that for a matrix A of order n, the difference AA−AA is nonsingular if and only if R(A) ⊕ R(A) = Cn,1, where R(·) denotes the range space. Also we study matrices A such that R(A) = R(A).
متن کاملThe maximal probability that k-wise independent bits are all 1
A k-wise independent distribution on n bits is a joint distribution of the bits such that each k of them are independent. In this paper we consider k-wise independent distributions with identical marginals, each bit has probability p to be 1. We address the following question: how high can the probability that all the bits are 1 be, for such a distribution? For a wide range of the parameters n,...
متن کاملThe smallest of all worlds: pollination networks.
A pollination network may be either 2-mode, describing trophic and reproductive interactions between communities of flowering plants and pollinator species within a well-defined habitat, or 1-mode, describing interactions between either plants or pollinators. In a 1-mode pollinator network, two pollinator species are linked to each other if they both visit the same plant species, and vice versa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1983
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1983-0679453-8